Optimality and tight results in parameterized complexity (Dagstuhl Seminar 14451)

This report documents the program and the outcomes of Dagstuhl Seminar 14451 “Optimality and tight results in parameterized complexity”. Over the last two decades parameterized complexity has become one of the main tools for handling intractable problems. Recently, tools have been developed not only to classify problems, but also to make statements about how close an algorithm is to being optimal with respect to running time. The focus of this seminar is to highlight and discuss recent, relevant results within this optimality framework and discover fruitful research directions. The report contains the abstracts of the results presented at the seminar, as well as a collection of open problems stated at the seminar. Seminar November 2–7, 2014 – http://www.dagstuhl.de/14451 1998 ACM Subject Classification G.2.1 Combinatorics, G.2.2 Graph Theory, F.1.3 Complexity Measures and Classes